Risk Management in Herd Sire Portfolio Selection: A Comparison of Rounded Quadratic and Separable Convex Programming
نویسندگان
چکیده
منابع مشابه
Quadratic Programming Applied to Modern Portfolio Selection
The mean-variance formulation by Markowitz in 1956 and its efficient solution by Wolfe in 1959 paved a foundation for modern portfolio selection. In this work we start reviewing basic concepts about portfolio selection, showing one starting solution and then the mean-variance analysis proposed by Markowitz. We show an algorithm for efficient frontier derivation, proposed by Wolfe, and analyze t...
متن کاملassessment of deep word knowledge in elementary and advanced iranian efl learners: a comparison of selective and productive wat tasks
testing plays a vital role in any language teaching program. it allows teachers and stakeholders, including program administrators, parents, admissions officers and prospective employers to be assured that the learners are progressing according to an accepted standard (douglas, 2010). the problems currently facing language testers have both practical and theoretical implications but the first i...
A Fuzzy Goal Programming Model for Efficient Portfolio Selection.
This paper considers a multi-objective portfolio selection problem imposed by gaining of portfolio, divided yield and risk control in an ambiguous investment environment, in which the return and risk are characterized by probabilistic numbers. Based on the theory of possibility, a new multi-objective portfolio optimization model with gaining of portfolio, divided yield and risk control is propo...
متن کاملExtension of Portfolio Selection Problem with Fuzzy Goal Programming: A Fuzzy Allocated Portfolio Approach
Recently, the economic crisis has resulted in instability in stock exchange market and this has caused high volatilities in stock value of exchanged firms. Under these conditions, considering uncertainty for a favorite investment is more serious than before. Multi-objective Portfolio selection (Return, Liquidity, Risk and Initial cost of Investment objectives) using MINMAX fuzzy goal programmin...
متن کاملThe Separable Convex Quadratic Knapsack Problem
This paper considers the problem of minimizing a convex, separable quadratic function subject to a knapsack constraint and a box constraint. An algorithm called NAPHEAP is developed for solving this problem. The algorithm solves the Karush-Kuhn-Tucker system using a starting guess to the optimal Lagrange multiplier and updating the guess monotonically in the direction of the solution. The start...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Dairy Science
سال: 1996
ISSN: 0022-0302
DOI: 10.3168/jds.s0022-0302(96)76364-6